A Consensus Matching Algorithm with FREAK Features
نویسندگان
چکیده
منابع مشابه
A Consensus Algorithm for Approximate String Matching
Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Matching Through Features and Features Through Matching
This paper addresses how to construct features for the problem of image correspondence, in particular, the paper addresses how to construct features so as to maintain the right level of invariance versus discriminability. We show that without additional prior knowledge of the 3D scene, the right tradeoff cannot be established in a pre-processing step of the images as is typically done in most f...
متن کاملA Freak of Nature
Mrs. W., residing at Howrali in her tenth pregnancy, had menstruated on the 4th or 5th February last for five or six days as was usual with her. On the 4th or 5th June she had a ' shew ' for a day, and again in June she saw another 4 shew' for a day. All went well with her till the morning of 29th September about 7i months from conception when, while attending to her household duties she felt s...
متن کاملEvolving Consensus Sequences with a Genetic Algorithm
In this paper we present an approach that employs a genetic algorithm (GA) to evolve the consensus sequences for DNA and protein sequences alignments. We have developed an encoding scheme such that the number of generations needed to find the optimal solution remains approximately the same regardless the number of sequences. The complexity instead depends only on the length of the consensus seq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cst2017/12592